Entropy Weighting Genetic k-Means Algorithm for Subspace Clustering
نویسندگان
چکیده
منابع مشابه
Entropy Weighting Genetic k-Means Algorithm for Subspace Clustering
This paper presents a genetic k-means algorithm for clustering high dimensional objects in subspaces. High dimensional data faces data sparsity problem. In this algorithm, we present the genetic k-means clustering process to calculate a weight for each dimension in each cluster and use the weight values to identify the subsets of important dimensions that categorize different clusters. This is ...
متن کاملSubspace K-means clustering.
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic, stochastic, and unsupervised learning app...
متن کاملModified K-Means Algorithm for Genetic Clustering
The K-Means Clustering Approach is one of main algorithms in the literature of Pattern recognition and Machine Learning. Yet, due to the random selection of cluster centers and the adherence of results to initial cluster centers, the risk of trapping into local optimality ever exists. In this paper, inspired by a genetic algorithm which is based on the K-means method , a new approach is develop...
متن کاملEnhanced Clustering Based on K-means Clustering Algorithm and Proposed Genetic Algorithm with K-means Clustering
-In this paper targeted a variety of techniques, tactics and distinctive areas of the studies that are useful and marked because the crucial discipline of information mining technologies. The overall purpose of the system of statistics mining is to extract beneficial facts from a large set of information and changing it right into a shape that is comprehensible for in addition use. Clustering i...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/1263-1628